Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 442 - Matrix chain multiplication / 442.cpp
blob48651fbc4a20b4a5c2f2592cbef6596445d8175f
1 #include <iostream>
2 #include <map>
3 #include <cassert>
5 using namespace std;
7 typedef pair<int, int> par;
9 string line;
10 int total, pos;
11 bool error;
12 map<char, par> d;
14 void match(const string &s){
15 //cout << "Matching: " << s << endl;
16 for (int i=0, n = s.size(); i<n; ++i){
17 assert(line[pos++] == s[i]);
21 par E(){
22 if (line[pos] == '('){
23 match("(");
24 par a = E();
25 par b = E();
26 //cout << "a es: (" << a.first << ", " << a.second << ")" << endl;
27 //cout << "b es: (" << b.first << ", " << b.second << ")" << endl;
28 if (a.second != b.first){
29 error = true;
31 match(")");
32 total += a.first * a.second * b.second;
33 return par(a.first, b.second);
34 }else if ('A' <= line[pos] && line[pos] <= 'Z'){
35 char c = line[pos];
36 match(string(1, c));
37 return d[c];
41 int main(){
42 int n;
44 cin >> n;
45 while (n--){
46 char c;
47 int x, y;
48 cin >> c >> x >> y;
49 d[c] = par(x, y);
51 getline(cin, line);
52 while (getline(cin, line) && line != ""){
53 //cout << "line es: " << line << endl;
54 total = pos = 0;
55 error = false;
56 E();
57 if (error)
58 cout << "error" << endl;
59 else
60 cout << total << endl;
62 return 0;